Network-theoretic classification of parallel computation patterns
نویسندگان
چکیده
منابع مشابه
Network-theoretic classification of parallel computation patterns
Parallel computation in a high performance computing environment can be characterized by the distributed memory access patterns of the underlying algorithm. During execution, networks of compute nodes exchange messages that indirectly exhibit these access patterns. Thus, identifying the algorithm underlying these observable messages is the problem of latent class analysis over information flows...
متن کاملEfficient Computation of Semivalues for Game-Theoretic Network Centrality
Solution concepts from cooperative game theory, such as the Shapley value or the Banzhaf index, have recently been advocated as interesting extensions of standard measures of node centrality in networks. While this direction of research is promising, the computation of game-theoretic centrality can be challenging. In an attempt to address the computational issues of game-theoretic network centr...
متن کاملCircuit Theoretic Classification of Parallel Connected DC-DC Converters
This paper describes a classification of paralleling schemes for dc–dc converters from a circuit theoretic viewpoint. The purpose is to provide a systematic classification of the types of parallel converters that can clearly identify all possible structures and control configurations, allowing simple and direct comparison of the characteristics and limitations of different paralleling schemes. ...
متن کاملInformation-theoretic computation complexity
This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an informationtheoretic version of Giidel’s theorem on the limitations of...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of High Performance Computing Applications
سال: 2012
ISSN: 1094-3420,1741-2846
DOI: 10.1177/1094342012436618